Finite Groups, Designs and Codes
نویسنده
چکیده
Introduction Terminology and notation Group Actions and Permutation Characters Method 1 References Finite Groups, Designs and Codes J Moori School of Mathematical Sciences, University of KwaZulu-Natal Pietermaritzburg 3209, South Africa ASI, Opatija, 31 May –11 June 2010 J Moori, ASI 2010, Opatija, Croatia Groups, Designs and Codes Abstract Introduction Terminology and notation Group Actions and Permutation Characters Method 1 ReferencesIntroduction Terminology and notation Group Actions and Permutation Characters Method 1 References Finite Groups, Designs and Codes J Moori School of Mathematical Sciences, University of KwaZulu-Natal Pietermaritzburg 3209, South Africa ASI, Opatija, 31 May –11 June 2010 J Moori, ASI 2010, Opatija, Croatia Groups, Designs and Codes Abstract Introduction Terminology and notation Group Actions and Permutation Characters Method 1 ReferencesIntroduction Terminology and notation Group Actions and Permutation Characters Method 1 References
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملPermutation decoding for codes from designs, finite geometries and graphs
The method of permutation decoding was first developed by MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a set of automorphisms, called a PD-set, that has some specifed properties. These talks will describe some recent developments in finding PD-sets for codes defined through the row-span over finite fields...
متن کاملOn the automorphisms of designs constructed from finite simple groups
Here we study the automorphism groups of 1-designs constructed from finite nonabelian simple groups by using two methods presented in Moori (Information Security, Coding Theory and Related Combinatorics, 2011) [9]. We obtain some general results for both and improve one of these methods. In an application to the sporadic Mathieu groups Mn, we are able to retrieve the Steiner systems S(t, t+ 3, ...
متن کاملLine codes generated by finite Coxeter groups
Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of b bits over b+1 wires that admit especially simple encoding and decoding algorithms. A number of designs are exhibited, some of them being novel or improving on previously obtained codes.
متن کاملDivisible designs with dual translation group
Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism group enables us to characterize its associated divisible design as being isomorphic to a substructure of a finite affine space. AMS Classification: 05B05, 05B30, 20B25, 51N10
متن کامل